Path-probability density functions for semi-Markovian random walks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path-probability density functions for semi-Markovian random walks.

In random walks, the path representation of the Green's function is an infinite sum over the length of path probability density functions (PDFs). Recently, a closed-form expression for the Green's function of an arbitrarily inhomogeneous semi-Markovian random walk in a one-dimensional (1D) chain of L states was obtained by utilizing path-PDFs calculations. Here we derive and solve, in Laplace s...

متن کامل

Skip-free Random Walks with Markovian Increments

Let (ξk, k ≥ 0) be a Markov chain on {−1, +1} with ξ0 = 1 and transition probabilities P (ξk+1 = 1| ξk = 1) = a and P (ξk+1 = −1| ξk = −1) = b < a. Set X0 = 0, Xn = ξ1 + · · ·+ ξn and Mn = max0≤k≤n Xk. We prove that the process 2M − X has the same law as that of X conditioned to stay non-negative. Pitman’s representation theorem [19] states that, if (Xt, t ≥ 0) is a standard Brownian motion and...

متن کامل

Finding Good Termination Probability for Random-walks

In this paper we study the survival probability of the followed ray in random walk global illumination algorithms. When the ray hits a surface, the survival probability is responsible for the dying of the ray, thus for finishing the walk. We examine the variance of the Russian roulette random walk estimator of gathering type, give an explanation of the formula and show visually the behavior of ...

متن کامل

Steady State Random Walks for Path Estimation

This paper describes a graph-spectral method for path estimation. Our aim is to find a maximum probability path through a lattice of pixel sites. We characterise the path recovery problem using a site transition matrix. A graph-spectral analysis of the transition matrix reveals how the maximum probability path can be located using an eigenvector of the associated normalised affinity matrix. We ...

متن کامل

Random Walks on Quasisymmetric Functions

Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained. Several important random walks are now realized this way: Stanley’s QS-distribution results from endomorphisms given by evaluation maps, a-shuffles result from th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2007

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.76.041101